On the Regularisation in J-matrix Methods
نویسنده
چکیده
We investigate the effects of the regularization procedure used in the J-Matrix method. We show that it influences the convergence, and propose an alternative regularization approach.We explicitly perform some model calculations to demonstrate the improvement.
منابع مشابه
Data Unfolding Methods in High Energy Physics
A selection of unfolding methods commonly used in High Energy Physics is compared. The methods discussed here are: bin-by-bin correction factors, matrix inversion, template fit, Tikhonov regularisation and two examples of iterative methods. Two procedures to choose the strength of the regularisation are tested, namely the L-curve scan and a scan of global correlation coefficients. The advantage...
متن کاملThe spectral properties of differential operators with matrix coefficients on elliptic systems with boundary conditions
Let $$(Lv)(t)=sum^{n} _{i,j=1} (-1)^{j} d_{j} left( s^{2alpha}(t) b_{ij}(t) mu(t) d_{i}v(t)right),$$ be a non-selfadjoint differential operator on the Hilbert space $L_{2}(Omega)$ with Dirichlet-type boundary conditions. In continuing of papers [10-12], let the conditions made on the operator $ L$ be sufficiently more general than [11] and [12] as defined in Section $1$. In this paper, we estim...
متن کاملTwo Robust Super Resolution Approaches in Aeroacoustic Imaging for Near-field Wideband Extended Sources
Recently deconvolution-based methods, like the DAMAS, have greatly improved spatial resolutions of the Beamforming in aeroacoustic imaging. But most of existing methods are not robust to background noise. In this paper, we propose two robust superresolution approaches using Sparsity Constraint (SC-RDAMAS) and Sparse Regularisation (SR-RDAMAS) respectively to simultaneously estimate source power...
متن کاملVariational data assimilation via sparse regularisation
This paper studies the role of sparse regularisation in a properly chosen basis for variational data assimilation (VDA) problems. Specifically, it focuses on data assimilation of noisy and down-sampled observations while the state variable of interest exhibits sparsity in the real or transform domains. We show that in the presence of sparsity, the ‘1-norm regularisation produces more accurate a...
متن کاملRegularization path for Ranking SVM
Ranking algorithms are often introduced with the aim of automatically personalising search results. However, most ranking algorithms developed in the machine learning community rely on a careful choice of some regularisation parameter. Building upon work on the regularisation path for kernel methods, we propose a parameter selection algorithm for ranking SVM. Empirical results are promising.
متن کامل